( $$\delta ,{\varepsilon }$$ δ , ε )-Ball Approximation of a Shape: Definition and Complexity
نویسندگان
چکیده
منابع مشابه
A Nonstandard Proof of the Jordan Curve Theorem
We give a nonstandard variant of Jordan’s proof of the Jordan curve theorem which is free of the defects his contemporaries criticized and avoids the epsilontic burden of the classical proof. The proof is selfcontained, except for the Jordan theorem for polygons taken for granted.
متن کاملthe effect of task complexity on lexical complexity and grammatical accuracy of efl learners’ argumentative writing
بر اساس فرضیه شناخت رابینسون (2001 و 2003 و 2005) و مدل ظرفیت توجه محدود اسکهان (1998)، این تحقیق تاثیر پیچیدگی تکلیف را بر پیچیدگی واژگان و صحت گرامری نوشتار مباحثه ای 60 نفر از دانشجویان زبان انگلیسی بررسی کرد. میزان پیچیدگی تکلیف از طریق فاکتورهای پراکندگی-منابع تعیین شد. همه ی شرکت کنندگان به صورت نیمه تصادفی به یکی از سه گروه: (1) گروه موضوع، (2) گروه موضوع + اندیشه و (3) گروه موضوع + اندی...
15 صفحه اولVC Dimension, ε-nets and ε-approximation
“I’ve never touched the hard stuff, only smoked grass a few times with the boys to be polite, and that’s all, though ten is the age when the big guys come around teaching you all sorts to things. But happiness doesn’t mean much to me, I still think life is better. Happiness is a mean son of a bitch and needs to be put in his place. Him and me aren’t on the same team, and I’m cutting him dead. I...
متن کاملDifferential Forms and Integration
a f(x) dx (which one would use for instance to compute the work required to move a particle from a to b). For simplicity we shall restrict attention here to functions f : R → R which are continuous on the entire real line (and similarly, when we come to differential forms, we shall only discuss forms which are continuous on the entire domain). We shall also informally use terminology such as “i...
متن کاملComplexity and approximation ratio of semitotal domination in graphs
A set $S subseteq V(G)$ is a semitotal dominating set of a graph $G$ if it is a dominating set of $G$ andevery vertex in $S$ is within distance 2 of another vertex of $S$. Thesemitotal domination number $gamma_{t2}(G)$ is the minimumcardinality of a semitotal dominating set of $G$.We show that the semitotal domination problem isAPX-complete for bounded-degree graphs, and the semitotal dominatio...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: Discrete & Computational Geometry
سال: 2018
ISSN: 0179-5376,1432-0444
DOI: 10.1007/s00454-018-0019-8